High Performance Elliptic Curve Point Operations
نویسندگان
چکیده
This paper studies the effect of high performance pipelined GF(2 256 ) bit-serial multiplier on elliptic curve point operations. A 3-stage pipelined version of the Massy-Omura GF(2 m ) normal basis multiplier for 160 ≤ m ≤ 256 was studied in terms of area overhead and throughput improvement. Simple gate area and delay models were used to estimate the throughput of the pipelined and the non-pipelined multipliers. The proposed pipelined architecture has been shown to have a significant improvement in throughput allowing a single 3-stage pipelined multiplier to have higher throughput than an architecture employing three parallel non-pipelined multipliers. The AT 2 performance metric has shown an even more significant improvement.
منابع مشابه
High speed and Low space complexity FPGA based ECC processor
Elliptic Curve Cryptography is one of the most interested research topic in VLSI. Network security is becoming more and more crucial as the volume of data being exchanged on the Internet increases. ECC offers high security for networking and communication. FPGA based architecture for elliptic curve cryptography coprocessor ,which has promising performance in terms of both Space Complexity and T...
متن کاملHigh radix parallel architecture for GF(p) elliptic curve processor
A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملAnalyzing the point multiplication operation of elliptic curve cryptosystem over prime field for parallel processing
The Elliptic Curve Cryptosystem shortly called as (ECC) is one of the asymmetric key cryptosystems, which provides a high security for wireless applications compared to other asymmetric key cryptosystem. The implementation of this algorithm over prime field Zp has a set of point operations, which are point addition, point subtraction, point multiplication, point division, point inversion, and p...
متن کاملEfficient Algorithms for Elliptic Curve Cryptosystems
Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This thesis deals with such algorithms. Efficient algorithms for elliptic curves can be classified into ...
متن کامل